bin packing problem
英 [bɪn ˈpækɪŋ ˈprɒbləm]
美 [bɪn ˈpækɪŋ ˈprɑːbləm]
网络 装箱问题; 一维装箱问题; 问题
双语例句
- Bin packing, or the placement of objects of certain weights into different bins subject to certain constraints, is an historically interesting problem.
装箱问题，即在一定的约束条件下如何将不同重量的物体放入不同的箱子，是一个历史悠久的有趣问题。 - Approximation Algorithms for the Constrained Bin Packing Problem
带约束的一维装箱问题近似算法的研究 - This paper gives a heuristic algorithm DLPT for bin packing problem by using LPT algorithm of scheduling theory and binary search method.
本文利用二分搜索法和时间表理论中LPT算法求解装箱问题的近似最优解； - Bin packing is a combinatorial optimization and NP-complete problem and widely applied to the mechanical manufacture and traffic transportation industries.
装箱问题广泛地用于机械生产和交通运输等行业当中。 - It begins by summarizing the bin packing problem in sorts and their research method, as well as analysis on the current research on the bin packing problem.
本文首先对装箱问题的种类、研究现状以及国内外研究方法进行了综述和分析。 - Two Semi-online Algorithms for Bin Packing Problem
两种准在线装箱算法 - Bin packing problem with over sized items and a new algorithm
超尺寸物品装箱问题及其算法 - This paper presents a new model, the A Shaped Bin Packing Problem ( ASBP), for industrial manufacturing systems. It is a variant of the classical one dimensional bin packing problem in which each item has two parameters, height and diameter.
A形装箱问题是由生产实际引发的一个新的数学模型，它是经典一维装箱问题的一种变形&每样物品有高度和半径两个参数。 - On-line A-shaped bin packing problem: models and analysis of heuristics
在线A形装箱问题：模型及算法研究 - Bin Packing Problem with Rejection in the Information Organization and Allocation of Internet and Web
互联网信息组织和规划中的带拒绝装箱问题 - An application of LPT algorithm in scheduling theory to bin packing problem
时间表理论中LPT算法在装箱问题中的应用 - One dimensional bin packing problem has many important applications such as multiprocessor scheduling, resource allocation, real world planning, and packing and scheduling optimization problems.
经典一维装箱问题在多处理器调度、资源分配和日常生活中的计划、包装、调度等优化问题中有着极为重要的应用。 - We know that bin packing problem is NP& hard, so the method of solving this problem is to find its approximate solution only.
由于这类问题属NP&困难问题，只能用近似算法来求解。 - On a Constrained Bin Packing Problem with Start-Up Space
受启动空间约束的装箱问题 - The ship needs to be arranged into the two-dimensional space ( arrange ships) in accordance with the timetable of the sequence ( the arrangement answer includes the location information of the ships in the ship lock), that is, a bin packing problem from space aspect.
由于船舶需要编排到船闸之中，根据时间表序列对二维空间（船闸闸室）进行排档（排档结果包括船舶在船闸内的位置信息），即空间上的binpacking问题。 - Bin packing problem is the core issue of the logistics links, and it is important to improve logistics efficiency and reduce logistics cost that realizing the optimization of bin packing problem.
装箱问题是物流环节的核心问题，实现装箱问题的优化对于提高物流效率、降低物流成本具有重要意义。 - Bin Packing problem ( BPP) is one of the most famous combinatorial optimization problem. And it is the emphasis of the analysis of approximation algorithms.
装箱问题是最经典的组合优化问题之一，同时也是算法分析理论中研究的重点。 - The minimum grouping problem is a class of some concrete problems such as the bin packing problem, the graph coloring problem, and the minimum clique cover problem.
最小分组问题是一类问题的统称，许多具体的问题，如装箱问题、图分色问题和最小团覆盖问题等，都属于最小分组问题。 - Bin Packing Problem ( BPP) is one of the most famous combinatorial optimization problems. And as one of the earliest studied NP-hard problem, it works as a research platform for the complexity theory and gives director to other NP-hard problems.
装箱问题是经典的组合优化问题之一，它作为一种最早研究的NP-难解问题和复杂性理论的研究平台，为其它NP-难解问题的研究提供了诸多借鉴。